Estimation of the entropy based on its polynomial representation.
نویسندگان
چکیده
Estimating entropy from empirical samples of finite size is of central importance for information theory as well as the analysis of complex statistical systems. Yet, this delicate task is marred by intrinsic statistical bias. Here we decompose the entropy function into a polynomial approximation function and a remainder function. The approximation function is based on a Taylor expansion of the logarithm. Given n observations, we give an unbiased, linear estimate of the first n power series terms based on counting sets of k coincidences. For the remainder function we use nonlinear Bayesian estimation with a nearly flat prior distribution on the entropy that was developed by Nemenman, Shafee, and Bialek. Our simulations show that the combined entropy estimator has reduced bias in comparison to other available estimators.
منابع مشابه
Canonical representation for approximating solution of fuzzy polynomial equations
In this paper, the concept of canonical representation is proposed to find fuzzy roots of fuzzy polynomial equations. We transform fuzzy polynomial equations to system of crisp polynomial equations, this transformation is perform by using canonical representation based on three parameters Value, Ambiguity and Fuzziness.
متن کاملON LOCAL HUDETZ g-ENTROPY
In this paper, a local approach to the concept of Hudetz $g$-entropy is presented. The introduced concept is stated in terms of Hudetz $g$-entropy. This representation is based on the concept of $g$-ergodic decomposition which is a result of the Choquet's representation Theorem for compact convex metrizable subsets of locally convex spaces.
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملMonitoring and Change Point Estimation of AR(1) Autocorrelated Polynomial Profiles
In this paper, a remedial measure is first proposed to eliminate the effect of autocorrelation in phase-ІІ monitoring of autocorrelated polynomial profiles, where there is a first order autoregressive (AR(1)) relation between the error terms in each profile. Then, a control chart based on the generalized linear test (GLT) is proposed to monitor the coefficients of polynomial profiles and an R-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 85 5 Pt 1 شماره
صفحات -
تاریخ انتشار 2012